integer modulo n

См. также в других словарях:

• Modulo operation — Quotient (red) and remainder (green) functions using different algorithms. In computing, the modulo operation finds the remainder of division of one number by another. Given two positive numbers, a (the dividend) and n (the divisor), a modulo n… …   Wikipedia

• Modulo —   [Abk. mod], eine in den meisten Programmiersprachen vorhandene Funktion, die zur Berechnung des Restwerts einer Division »mit Rest« dient. Diesen erhält man, indem man nach der Division die Vorkommastellen des Ergebnisses streicht und die… …   Universal-Lexikon

• Modulo (jargon) — The word modulo (Latin, with respect to a modulus of ) is the Latin ablative of modulus which itself means a small measure. It was introduced into mathematics in the book Disquisitiones Arithmeticae by Carl Friedrich Gauss in 1801. Ever since,… …   Wikipedia

• Integer — This article is about the mathematical concept. For integers in computer science, see Integer (computer science). Symbol often used to denote the set of integers The integers (from the Latin integer, literally untouched , hence whole : the word… …   Wikipedia

• Integer overflow — In computer programming, an integer overflow occurs when an arithmetic operation attempts to create a numeric value that is larger than can be represented within the available storage space. For instance, adding 1 to the largest value that can be …   Wikipedia

• Integer notation — In integer notation, or the integer model of pitch, all pitch classes and intervals between pitch classes are designated using the numbers 0 through 11. It is not used to notate music for performance, but is a common analytical and compositional… …   Wikipedia

• Primitive root modulo n — In modular arithmetic, a branch of number theory, a primitive root modulo n is any number g with the property that any number coprime to n is congruent to a power of g (mod n ). That is, if g is a primitive root (mod n ) and gcd( a , n ) = 1,… …   Wikipedia

• Blum integer — In mathematics, more specifically in number theory, a natural number n is a Blum integer if n = pq is a semiprime for which p and q are distinct prime numbers congruent to 3 mod 4. That is, p and q must be of the form 4 t +3, for some integer t …   Wikipedia

• Multiplicative group of integers modulo n — In modular arithmetic the set of congruence classes relatively prime to the modulus n form a group under multiplication called the multiplicative group of integers modulo n. It is also called the group of primitive residue classes modulo n. In… …   Wikipedia

• Satisfiability Modulo Theories — (SMT) problem is a decision problem for logical formulas with respect to combinations of background theories expressed in classical first order logic with equality. Examples of theories typically used in computer science are the theory of real… …   Wikipedia

• Gaussian integer — In number theory, a Gaussian integer is a complex number whose real and imaginary part are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as Z[i]. The… …   Wikipedia